Bondage of Time and Human Bondage in Anita Desai's Clear Light of Day
نویسندگان
چکیده
منابع مشابه
Of human bondage.
One of the wealthiest and most popular authors of the twentieth century was a doctor. His best known book included some vivid accounts of his experiences as a medical student. It is a masterpiece, but also provides the richest first-hand description we have of medicine in late Victorian London and is worth reading for that reason alone. William Somerset Maugham was born in 1874 into a family of...
متن کاملBondage and Non-bondage Number of a Fuzzy Graph
In this paper, bondage and non-bondage set of a fuzzy graph are discussed. The bondage number b(G) and non-bondage number bn(G) of a fuzzy graph G are defined. The upper bound for both b(G) and bn(G) are given. Also some results on b(G) and bn(G) are discussed. The exact values of b(G) and bn(G) are determined for several classes of fuzzy graphs. AMS Subject Classification: 03E72, 05C40, 05C72
متن کاملRoman bondage in graphs
A Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman dominating function is the value f(V (G)) =
متن کاملComplexity of Bondage and Reinforcement
Let G = (V,E) be a graph. A subset D ⊆ V is a dominating set if every vertex not in D is adjacent to a vertex in D. A dominating set D is called a total dominating set if every vertex in D is adjacent to a vertex in D. The domination (resp. total domination) number of G is the smallest cardinality of a dominating (resp. total dominating) set of G. The bondage (resp. total bondage) number of a n...
متن کاملRestrained bondage in graphs
Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. We define the restrained bondage number br(G) of a nonempty graph G to be the minimum cardinality among all sets of edges E′ ⊆...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of English Literature and Social Sciences
سال: 2020
ISSN: 2456-7620
DOI: 10.22161/ijels.54.32